Faster Algorithms for Computing Plurality Points
نویسندگان
چکیده
منابع مشابه
Faster Algorithms for Computing Plurality Points
Let V be a set of n points in R, which we call voters, where d is a fixed constant. A point p ∈ R is preferred over another point p′ ∈ R by a voter v ∈ V if dist(v, p) < dist(v, p′). A point p is called a plurality point if it is preferred by at least as many voters as any other point p′. We present an algorithm that decides in O(n logn) time whether V admits a plurality point in the L2 norm an...
متن کاملFaster Algorithms for some Optimization Problems on Collinear Points
We propose faster algorithms for the following three optimization problems on n collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in higher dimensions. 1. Maximizing total area of disjoint disks: In this problem the goal is to maximize the total area of nonoverlapping disks centered at the points. Acharyya, De, and Nandy (2017) presented an O(n)-tim...
متن کاملFaster Algorithms for Computing Distances between One-Dimensional Point Sets
Let S and T be two finite sets of points on the real line with |S| + |T | = n and |S| > |T |. We consider two distance measures between S and T that have applications in music information retrieval and computational biology: the surjection distance and the link distance. The former is called the restriction scaffold assignment problem in computational biology, and assigns each point of S to a p...
متن کاملFaster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
A repeat in a string is a substring that occurs more than once. A repeat is extendible if every occurrence of the repeat has an identical letter either on the left or on the right; otherwise, it is maximal. A multirepeat is a repeat that occurs at least mmin times (mmin ≥ 2) in each of at least q ≥ 1 strings in a given set of strings. In this paper, we describe a family of efficient algorithms ...
متن کاملFaster Algorithms for Computing Longest Common Increasing Subsequences
We present algorithms for finding a longest common increasing subsequence of two or more input sequences. For two sequences of lengths n and m, where m ≥ n, we present an algorithm with an output-dependent expected running time of O((m + nl) log log σ + Sort) and O(m) space, where l is the length of an LCIS, σ is the size of the alphabet, and Sort is the time to sort each input sequence. For k ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2018
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3186990